package dataStructBinaryTree;

public class test {

    public static void main(String[] args) {

//        TestLeeCoNiuKe testLeeCoNiuKe = new TestLeeCoNiuKe();
//        int[] num = {1,1,2};
//        int k = testLeeCoNiuKe.removeDuplicates(num);
//        System.out.println(k);
//        MyBinaryTree myBinaryTree = new MyBinaryTree();
//        MyBinaryTree.TreeNode root = myBinaryTree.createTree();
//
//        myBinaryTree.preOrder(root);
//        System.out.println();
//        myBinaryTree.inOrder(root);
//        System.out.println();
//        myBinaryTree.postOrder(root);
//        System.out.println();
//        System.out.println(myBinaryTree.size(root));
//        System.out.println(myBinaryTree.getLeafNodeCount(root));
//        System.out.println("==========");
//        System.out.println(myBinaryTree.getKLevelNodeCount(root,3));
//        System.out.println(myBinaryTree.getHeight(root));


//        TestLeeCoNiuKe test1 = new TestLeeCoNiuKe();
//
//        test1.isSubtree(root,subRoot);

    }
}
